- context-sensitive rules
- baglama bagimli kurallar
English to Turkish dictionary. 2009.
context-sensitive rules
Look at other dictionaries:
Context-sensitive grammar — A context sensitive grammar (CSG) is a formal grammar in which the left hand sides and right hand sides of any production rules may be surrounded by a context of terminal and nonterminal symbols. Context sensitive grammars are more general than… … Wikipedia
Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… … Wikipedia
context — In linguistics, context is the parts of an utterance surrounding a unit and which may affect both its meaning and its grammatical contribution. A context free grammar is one where the rules apply regardless of context; a context sensitive grammar … Philosophy dictionary
Deterministic context-free grammar — In formal grammar theory, the deterministic context free grammars (DCFGs) are a proper subset of the context free grammars. The deterministic context free grammars are those a deterministic pushdown automaton can recognize. A DCFG is the finite… … Wikipedia
price sensitive information — (PSI) In the context of the insider dealing regime under the Criminal Justice Act 1993, information in relation to securities which would if made public be likely to have a significant effect on the price of the securities. This term was also… … Law dictionary
The Sound Pattern of English — (frequently referred to as SPE) is a work on phonology (a branch of linguistics) by Noam Chomsky and Morris Halle. It presents a comprehensive view of the phonology of English, and stands as a landmark both in the field of phonology and in the… … Wikipedia
Chomsky hierarchy — Within the field of computer science, specifically in the area of formal languages, the Chomsky hierarchy (occasionally referred to as Chomsky–Schützenberger hierarchy) is a containment hierarchy of classes of formal grammars. This hierarchy of… … Wikipedia
Controlled grammar — Controlled grammars[1] are a class of grammars that extend, usually, the context free grammars with additional controls on the derivations of a sentence in the language. A number of different kinds of controlled grammars exist, the four main… … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
Graftal — A graftal or L system is a formal grammar used in computer graphics to recursively define branching tree and plant shapes in a compact format. The shape is defined by a string of symbols constructed by a graftal grammar. A graftal grammar… … Wikipedia
Tree-adjoining grammar — (TAG) is a grammar formalism defined by Aravind Joshi. Tree adjoining grammars are somewhat similar to context free grammars, but the elementary unit of rewriting is the tree rather than the symbol. Whereas context free grammars have rules for… … Wikipedia
